A Block Cipher Basing Upon a Revisit to the Feistel Approach and the Modular Arithmetic Inverse of a Key Matrix
نویسندگان
چکیده
In this paper, we have developed a block cipher by using the modular arithmetic inverse of a key matrix. The key matrix is generated by taking the key in the form of twenty-eight numbers, wherein each number is represented in terms of seven binary bits. The encryption is carried out by using the key matrix containing binary bits. The decryption is performed by using the modular arithmetic inverse of the matrix.
منابع مشابه
A Block Cipher Obtained By Blending Modified Feistel Cipher And Advanced Hill Cipher Involving A Single Key Matrix
In this investigation, we have developed a block cipher which includes the basic ideas of the modified Feistel cipher and the advanced Hill cipher. In the advanced Hill cipher, as the modular arithmetic inverse of a matrix is the same as the matrix itself, the computations involved in the development of the inverse of the matrix are reduced remarkably. The cryptanalysis carried out in this inve...
متن کاملA Block Cipher Obtained By Blending Modified Feistel Cipher And Advanced Hill Cipher Involving A Pair Of Key Matrices
In this investigation, we have developed a block cipher by blending a modified Feistel cipher and the advanced Hill cipher. In this analysis, we have made use of a pair of involutory matrices, say A and B which include the keys K and L. Here the size of the plaintext is 1024 binary bits and the size of the keys (both put together) is 256 binary bits. The involutory matrices A and B, the modular...
متن کاملA Modified Feistel Cipher Involving Key Based Substitution, Shifting Of Rows, Key Based Mixing Of Columns, Modular Arithmetic Addition And Shuffling
In this paper, we have developed a block cipher by modifying the Feistel cipher. Here we have taken the plaintext in the form of a pair of matrices and we have introduced a set of operations called key based substitution, Shifting of rows, Key based mixing of columns, modular arithmetic addition and shuffling. In this analysis, the key based substitution and the key based mixing of columns play...
متن کاملA Large Block Cipher using an Iterative Method and the Modular Arithmetic Inverse of a key Matrix
In this paper, we have developed a block cipher for blocks of size 196 bits and 392 bits. In this, we have represented the plaintext in the form of a matrix of size 28 x 7, consisting of binary bits. The key matrix is represented in the form of a matrix of size 28 x 28, and it comprises binary bits. In the process of decryption, we have used the modular arithmetic inverse (K) of the key matrix ...
متن کاملThe New Block Cipher: BC2
In this paper, we propose a new block cipher called BC2 (Block Cipher 2). We make a cipher using components that are believed secure. The structure of BC2 is very simple. We use Feistel network with input-output 128 bits, matrix Maximum Distance Separable (MDS) 8x8 with branch number 9 to give high diffusion, a function affine equivalent to the inverse function in GF(2) that we get from Camelli...
متن کامل